Linearizing Some Recursive Logic Programs

نویسندگان

  • Irène Guessarian
  • Jean-Éric Pin
چکیده

We give in this paper a sufficient condition under which the least fixpoint of the equation X = a + f(X)X equals the least fixpoint of the equation X = a+ f(a)X. We then apply that condition to recursive logic programs containing chain rules: we translate it into a sufficient condition under which a recursive logic program containing n ≥ 2 recursive calls in the bodies of the rules is equivalent to a linear program containing at most one recursive call in the bodies of the rules. We conclude with a discussion comparing our condition with the other approaches to linearization studied in the literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strictly Level - Decreasing Logic Programs 1

We study strictly level-decreasing logic programs (sld-programs) as deened earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program ...

متن کامل

Strictly Level-Decreasing Logic Programs

We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic programs, have both a highly intuitive declarative semantics, given as a unique supported model, and are computationally adequate in the sense that every partial recursive function can be represented by some sld-program...

متن کامل

Proving correctness of imperative programs by linearizing constrained Horn clauses

We present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a program prog, we consider a partial correctness specification of the form {φ} prog {ψ}, where the assertions φ and ψ are predicates defined by a set Spec of possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premis...

متن کامل

Completing open logic programs by constructive induction

We consider part of the problem of schema-biased inductive synthesis of recursive logic programs from incomplete speciications, such as clausal evidence (for instance, but not necessarily , ground positive and negative examples). After synthesizing the base clause and introducing recursive call(s) to the recursive clause, it remains to combine the overall result from the partial results obtaine...

متن کامل

The Pac-Learnability of Recursive Logic Programs

We analyze the learnability of function-free recursive logic programs in the models of polynomial predictability and identiication from equivalence queries. Our ultimate goal is delineating the boundaries of eecient learnability for recursive logic programs. In the rst portion of the paper, we describe a restricted class of recursive programs that is learnable from equivalence queries alone. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Knowl. Data Eng.

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1995